Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms
نویسندگان
چکیده
A number of advances in software security over the past decade have foundations in the behavior matching problem: given a specification of software behavior and a concrete execution trace, determine whether the behavior is exhibited by the execution trace. Despite the importance of this problem, precise descriptions of algorithms for its solution, and rigorous analyses of their complexity, are missing in the literature. In this paper, we formalize the notion of behavior matching used by the software security community, study the complexity of the problem, and give several algorithms for its solution, both exact and approximate. We find that the problem is in general not efficiently solvable, i.e. behavior matching is NP-Complete. We demonstrate empirically that our approximation algorithms can be used to efficiently find accurate solutions to real instances.
منابع مشابه
DRAM Specific Approximation of the Faulty Behavior of Cell Defects
To limit the exponential complexity required to analyze the dynamic faulty behavior of DRAMs, algorithms have been published to approximate the faulty behavior of DRAM cell defects. These algorithms, however, have limited practical application since they are based on generic memory operations (writes and reads) rather than the DRAM specific operations (activation, precharge, etc.). This paper e...
متن کاملMaintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
We present a fully dynamic algorithm for maintaining approximate maximum weight matching in general weighted graphs. The algorithm maintains a matchingM whose weight is at least 1 8M ∗ where M∗ is the weight of the maximum weight matching. The algorithm achieves an expected amortized O(logn log C) time per edge insertion or deletion, where C is the ratio of the weights of the highest weight edg...
متن کاملImproved Algorithm for Dynamic b-Matching
Recently there has been extensive work on maintaining (approximate) maximum matchings in dynamic graphs. We consider a generalisation of this problem known as themaximum b-matching: Every node v has a positive integral capacity bv, and the goal is to maintain an (approximate) maximum-cardinality subset of edges that contains at most bv edges incident on every node v. The maximum matching proble...
متن کاملNew Iterative Algorithms for Weighted Matching
Matching is an important combinatorial problem with a number of practical applications. Even though there exist polynomial time solutions to most matching problems, there are settings where these are too slow. This has led to the development of several fast approximation algorithms that in practice compute matchings very close to the optimal. The current paper introduces a new deterministic app...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کامل